Lagrange Multivariate Polynomial Interpolation: A Random Algorithmic Approach
نویسندگان
چکیده
The problems of polynomial interpolation with several variables present more difficulties than those one-dimensional interpolation. first problem is to study the regularity schemes. In fact, it well-known that, in contrast univariate case, there no universal space polynomials which admits unique Lagrange for all point sets a given cardinality, and so will depend on set Z points. Techniques Newton interpolating are extended multivariate data points by different generalizations practical algorithms. basis format, divided-difference algorithm coefficients, generalizes straightforward way when at nodes grid within certain this work, we propose random computing polynomials, called RLMVPIA (Random Multivariate Polynomial Interpolation Algorithm), any finite set. We use Newton-type basis, introduce new concept id="M2"> , z -partition. All algorithms tested examples. easy implement requires storage.
منابع مشابه
On Lagrange multivariate interpolation problem in generalized degree polynomial spaces
The aim of this paper is to study the Lagrange multivariate interpolation problems in the space of polynomials of w-degree n. Some new results concerning the polynomial spaces of w-degree n are given. An algorithm for obtaining the w-minimal interpolation space is presented. Key–Words: Lagrange multivariate polynomial interpolation, whomogeneous polynomial spaces, Generalize degree.
متن کاملOn Multivariate Lagrange Interpolation
Lagrange interpolation by polynomials in several variables is studied through a finite difference approach. We establish an interpolation formula analogous to that of Newton and a remainder formula, both of them in terms of finite differences. We prove that the finite difference admits an integral representation involving simplex spline functions. In particular, this provides a remainder formul...
متن کاملA continuity property of multivariate Lagrange interpolation
Let {St} be a sequence of interpolation schemes in Rn of degree d (i.e. for each St one has unique interpolation by a polynomial of total degree ≤ d) and total order ≤ l. Suppose that the points of St tend to 0 ∈ Rn as t→ ∞ and the Lagrange-Hermite interpolants, HSt , satisfy limt→∞HSt(x) = 0 for all monomials xα with |α| = d + 1. Theorem: limt→∞HSt (f) = T d(f) for all functions f of class Cl−...
متن کاملOn multivariate polynomial interpolation
We provide a map Θ 7→ ΠΘ which associates each finite set Θ of points in C with a polynomial space ΠΘ from which interpolation to arbitrary data given at the points in Θ is possible and uniquely so. Among all polynomial spaces Q from which interpolation at Θ is uniquely possible, our ΠΘ is of smallest degree. It is also Dand scale-invariant. Our map is monotone, thus providing a Newton form for...
متن کاملIntertwining unisolvent arrays for multivariate Lagrange interpolation
Let Pd(C ) denote the space of polynomials of degree at most d in n complex variables. A subset X of C – we will usually speak of configuration or array – is said to be unisolvent for Pd(C ) (or simply unisolvent of degree d) if, for every function f defined on X there exists a unique polynomial P ∈ Pd(C ) such that P(x) = f (x) for every x ∈ X. This polynomial is called the Lagrange interpolat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2022
ISSN: ['1687-0042', '1110-757X']
DOI: https://doi.org/10.1155/2022/8227086